#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
	int n;
	cin >> n;
	vector<pair<int, int>> v;
	for (int i = 0; i < n; i++) {
		int x, y;
		cin >> x >> y;
		v.push_back({x, y});
	}

	int ansx1 = -1, ansy1 = -1, ansx2 = -1, ansy2 = -1;
	ll ans = LLONG_MIN;

	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			int x1 = v[i].first, y1 = v[i].second;
			int x2 = v[j].first, y2 = v[j].second;
			ll tmp = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
			if (tmp > ans) {
				ans = tmp;
				ansx1 = x1;
				ansx2 = x2;
				ansy2 = y2;
				ansy1= y1;
			}
		}
	}
	cout << ansx1 << ' ' << ansy1 << ' ' << ansx2 << ' ' << ansy2 << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	solve();
	return 0;
}